Abstract Views :173 |
PDF Views:2
Authors
Affiliations
1 Sathyabama University, Jeppiar Nagar, Chennai-119, IN
2 S&H Department, Bharath University, Selaiyur, Chennai-73, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 6 (2011), Pagination: 387-390
Abstract
In string token Petri nets (STPN), strings are used as tokens. In a Petri net, the sequence of firing of transitions which leads to the final marking forms a language. Whereas in string token Petri nets (STPN), the string in the final marking of STPN forms a language. Utilizing the concept of derivation in string languages, string token Petri net (STPN) derivation languages are studied. The ranking and unranking algorithm for the type of languages are discussed and complexity results are studied.
